/*
Source : https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/
Author : nflush@outlook.com
Date   : 2016-07-11
*/

/*
122. Best Time to Buy and Sell Stock II 

    Total Accepted: 94260
    Total Submissions: 217845
    Difficulty: Medium

Say you have an array for which the ith element is the price of a given stock on day i.

Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).

Subscribe to see which companies asked this question
*/
class Solution {
public:
    int maxProfit(vector<int>& prices) {
        if (prices.size() <= 1) return 0;
        int last = prices[0];
        int sum = 0;
        for (int i = 1; i < prices.size(); i++){
            if (prices[i] < last){
                last = prices[i];
            } else {
                sum += prices[i] - last;
                last = prices[i];
            }
        }
        return sum;
    }
};
